A triangular decomposition algorithm for differential polynomial systems with elementary computation complexity
نویسندگان
چکیده
In this paper, a new triangular decomposition algorithm is proposed for ordinary differential polynomial systems, which has triple exponential computational complexity. The key idea is to eliminate one algebraic variable from a set of polynomials in one step using the theory of multivariate resultant. This seems to be the first differential triangular decomposition algorithm with elementary computation complexity.
منابع مشابه
Symbolic computation of the Duggal transform
Following the results of cite{Med}, regarding the Aluthge transform of polynomial matrices, the symbolic computation of the Duggal transform of a polynomial matrix $A$ is developed in this paper, using the polar decomposition and the singular value decomposition of $A$. Thereat, the polynomial singular value decomposition method is utilized, which is an iterative algorithm with numerical charac...
متن کاملTOWARD HIGH - PERFORMANCE POLYNOMIAL SYSTEM SOLVERS BASED ON TRIANGULAR DECOMPOSITIONS ( Spine title : Contributions to Polynomial System
This thesis is devoted to the design and implementation of polynomial system solvers based on symbolic computation. Solving systems of non-linear, algebraic or differential equations, is a fundamental problem in mathematical sciences. It has been studied for centuries and still stimulates many research developments, in particular on the front of high-performance computing. Triangular decomposit...
متن کاملMultiplicity-preserving triangular set decomposition of two polynomials
In this paper, a multiplicity preserving triangular set decomposition algorithm is proposed for a system of two polynomials. The algorithm decomposes the variety defined by the polynomial system into unmixed components represented by triangular sets, which may have negative multiplicities. In the bivariate case, we give a complete algorithm to decompose the system into multiplicity preserving t...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملAlgebraic Algorithms
This is a preliminary version of a Chapter on Algebraic Algorithms in the upcoming Computing Handbook Set Computer Science (Volume I), CRCPress/Taylor and Francis Group. Algebraic algorithms deal with numbers, vectors, matrices, polynomials, formal power series, exponential and differential polynomials, rational functions, algebraic sets, curves and surfaces. In this vast area, manipulation wit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Systems Science & Complexity
دوره 30 شماره
صفحات -
تاریخ انتشار 2017